Kolmogorov random graphs only have trivial stable colorings
نویسندگان
چکیده
منابع مشابه
Perfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملOn trivial ends of Cayley graph of groups
In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...
متن کاملClopen Graphs, Inverse Limits, and Cochromatic Numbers
A graph G on a topological space X as its set of vertices is clopen if the edge relation of G is a clopen subset of X2 without the diagonal. We study clopen graphs on Polish spaces in terms of their finite induced subgraphs and obtain information about their cochromatic numbers. In this context we investigate modular profinite graphs, a class of graphs obtained from finite graphs by taking inve...
متن کاملSpatial Mixing of Coloring Random Graphs
We study the strong spatial mixing (decay of correlation) property of proper q-colorings of random graphG(n, d/n) with a fixed d. The strong spatial mixing of coloring and related models have been extensively studied on graphs with bounded maximum degree. However, for typical classes of graphs with bounded average degree, such as G(n, d/n), an easy counterexample shows that colorings do not exh...
متن کاملSparse Graphs Usually Have Exponentially Many Optimal Colorings
A proper coloring of a graph G = (V,E) is called optimal if the number of colors used is the minimal possible; i.e., it coincides with the chromatic number of G. We investigate the typical behavior of the number of distinct optimal colorings of a random graph G(n, p), for various values of the edge probability p = p(n). Our main result shows that for every constant 1/3 < a < 2, most of the grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 81 شماره
صفحات -
تاریخ انتشار 2002